A Branch-and-Cut Approach for the Vehicle Routing Problem with Two-dimensional Loading Constraints
نویسندگان
چکیده
In this paper, we present a branch-and-cut algorithm for the Vehicle Routing Problem with Two-dimensional Loading Constraints (2L-CVRP). The 2L-CVRP is a combination of the Capacitated Vehicle Routing Problem (CVRP) and the Two-dimensional Bin Packing Problem. We propose a strategy based on emphasizing cut generation using known families of valid inequalities for the CVRP. Checking packing feasibility is performed by combining heuristic and exact algorithms. We consider the unrestricted case and the sequential variant, in which unloading items can not be blocked by another customer’s items. The presented algorithm differs from the known exact algorithm in the literature by using different families of CVRP inequalities and different insertion strategies. Computational results showed a satisfactory decrease on the execution time for several instances from the literature.
منابع مشابه
A branch-and-cut approach for the vehicle routing problem with loading constraints
We consider a transport system problem which involves route planning for vehicles with containers attached, and cargo accommodation. The specific problem considered is the vehicle routing problem with loading constraints. Its input consists of a weighted undirected graph where vertices corresponds to clients and edges costs represents the cost to move the vehicle along that edge. Each vertex ha...
متن کاملAn Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints
We consider a special case of the symmetric capacitated vehicle routing problem, in which a fleet of K identical vehicles must serve n customers, each with a given demand consisting in a set of rectangular two-dimensional weighted items. The vehicles have a two-dimensional loading surface and a maximum weight capacity. The aim is to find a partition of the customers into routes of minimum total...
متن کاملA New School Bus Routing Problem Considering Gender Separation, Special Students and Mix Loading: A Genetic Algorithm Approach
In developing countries, whereas the urban bus network is a major part of public transportation system, it is necessary to try to find the best design and routing for bus network. Optimum design of school bus routes is very important. Non-optimal solutions for this problem may increase traveling time, fuel consumption, and depreciation rate of the fleet. A new bus routing problem is presented i...
متن کاملA multi-criteria vehicle routing problem with soft time windows by simulated annealing
This paper presents a multi-criteria vehicle routing problem with soft time windows (VRPSTW) to mini-mize fleet cost, routes cost, and violation of soft time windows penalty. In this case, the fleet is heterogene-ous. The VRPSTW consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. It is assumed that this relaxation a...
متن کاملVehicle Routing Problem in Competitive Environment: Two-Person Nonzero Sum Game Approach
Vehicle routing problem is one of the most important issues in transportation. Among VRP problems, the competitive VRP is more important because there is a tough competition between distributors and retailers. In this study we introduced new method for VRP in competitive environment. In these methods Two-Person Nonzero Sum games are defined to choose equilibrium solution. Therefore, revenue giv...
متن کامل